C-index: A weighted network node centrality measure for collaboration competence
نویسندگان
چکیده
This paper proposes a new node centrality measurement index (c-index) and its derivative indexes (iterative c-index and cg-index) to measure the collaboration competence of a node in a weighted network. We prove that c-index observe the power law distribution in the weighted scale-free network. A case study of a very large scientific collaboration network indicates that the indexes proposed in this paper are different from other common centrality measures (degree centrality, betweenness centrality, closeness centrality, eigenvector centrality and node strength) and other h-type indexes (lobby-index, w-lobby index and h-degree). The c-index and its derivative indexes proposed in this paper comprehensively utilize the amount of nodes’ neighbors, link strengths and centrality information of neighbor nodes to measure the centrality of a node, composing a new unique centrality measure for collaborative competency. © 2012 Elsevier Ltd. All rights reserved.
منابع مشابه
The Influence of Location on Nodes’ Centrality in Location-Based Social Networks
Nowadays, due to the widespread use of social networks, they can be used as a convenient, low-cost, and affordable tool for disseminating all kinds of information and data among the massive users of these networks. Issues such as marketing for new products, informing the public in critical situations, and disseminating medical and technological innovations are topics that have been considered b...
متن کاملبررسی شبکه هم تالیفی مجلات علمی پژوهشی فارسی حوزه علم اطلاعات و دانش شناسی
Purpose: the aim of this research is to design co-authorship network among Knowledge and Information science Persian Journals and to know the most important authors in the time period from 2008 to 2013. Moreover, in this article, co-authorship patterns and network integrity is measured. Methodology: We used scientometric tools and methods and some of the most important social network indexes ...
متن کاملControl Centrality and Hierarchical Structure in Complex Networks
We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly determined by the network's degree distribution. We show that in a directed network without loops the control centrality of a node is uniquely determined by its lay...
متن کاملKirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms
Estimating the relative importance of vertices and edges is a fundamental issue in the analysis of complex networks, and has found vast applications in various aspects, such as social networks, power grids, and biological networks. Most previous work focuses on metrics of vertex importance and methods for identifying powerful vertices, while related work for edges is much lesser, especially for...
متن کاملLocal search and heterogeneities in weighted complex networks
We discuss a new algorithm based on a network measure, local betweenness centrality (LBC), for search in complex networks that are heterogeneous in node degree and edge weights. LBC search utilizes both the heterogeneities and performs the best in scale-free weighted networks. We further argue that the amount of information used by LBC search could be optimal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Informetrics
دوره 7 شماره
صفحات -
تاریخ انتشار 2013